Revising deductive knowledge and stereotypical knowledge in a student model

A user/student model must be revised when new information about the user/student is obtained. But a sophisticated user/student model is a complex structure that contains different types of knowledge. Different techniques may be needed for revising different types of knowledge. This paper presents a student model maintenance system (SMMS) which deals with revision of two important types of knowledge in student models: deductive knowledge and stereotypical knowledge. In the SMMS, deductive knowledge is represented by justified beliefs. Its revision is accomplished by a combination of techniques involving reason maintenance and formal diagnosis. Stereotypical knowledge is represented in the Default Package Network (DPN). The DPN is a knowledge partitioning hierarchy in which each node contains concepts in a sub-domain. Revision of stereotypical knowledge is realized by propagating new information through the DPN to change default packages (stereotypes) of the nodes in the DPN. A revision of deductive knowledge may trigger a revision of stereotypical knowledge, which results in a desirable student model in which the two types of knowledge exist harmoniously.     

缺省理论的简化

缺省理论△=(D,W)中的缺省规则集D,是该理论的不确定因素.如果能去掉一些缺省规则而又不影响该理论的延伸,则就在一定程度上简化了该理论.本文证明了关于规范缺省理论的延伸的若干性质,利用这些性质,我们可以把某些规范缺省理论在一定条件下得以化简,有的甚至可以把它们化为一阶逻辑理论.     

Peirce algebras

We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a set-forming operator on relations (the Peirce product of Boolean modules) and a relation-forming operator on sets (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the so-calledterminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.     

Notes on Ginsberg's multivalued logics

The use of multivalued logics for knowledge representation and nonmonotonic reasoning has often been advocated, in particular within the general framework proposed by Ginsberg in his paper "Multivalued logics: a uniform approach to reasoning in artificial intelligence." His system is based on a multivalued logic with an arbitrary number of truth values classified with respect to two partial orders, a truth order and a knowledge order. This classification is very interesting and gives an intuitive appeal to the framework. In this paper the work by Ginsberg is critically reviewed, pointing out some flaws and ways to overcome them. Moreover, we present some ideas on how to modify the original schema in order to obtain a more semantically well-founded framework.
L'utilisation de la Iogique multivalente pour la représentation des connaissances et le raisonnement non monotone a souvent été préconisée, en particulier à l'intérieur du cadre général proposé par Ginsberg dans son article intitulé〘 Multivalued logics: a uniform approach to reasoning in artificial intelligence 〙 Son système est basé sur une logique multivalente comportant un nombre arbitraire de valeurs de vérité classées selon deux ordres partiels: un ordre de vérité et un ordre de connaissances. Cette classification est très intéressante et donne un attrait intuitif au cadre. Dans cet article, l'auteur examine le travail de Ginsberg, y relève des lacunes et propose des moyens de les corriger. De plus, il expose certaines idées en vue de modifier le schéma original et ainsi obtenir un meilleur cadre du point de vue de la sémantique.     

MetateM: An introduction

In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.     

坐标测量机结构热特性参数的估计

本文提出了一种通过热位移时间序列分析对坐标测量机结构热特性参数进行估计的计算机辅助实验方法。     

Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.     

基于柔性逻辑的智能控制器设计与仿真

研究倒立摆复杂系统优化控制问题,传统优化控制要建立精确数学模型,但与实际不符。对复杂系统采用具有认知和仿人功能、适应不确定环境等特性的智能控制方法较传统控制方法更具优势。为此,提出一种柔性泛逻辑学的智能控制模型,具有三个典型参数(e、h、k),分别反映了控制过程中的决策门限、被控量之间的关系和测量误差,能更好地掌握控制的思路。对三级倒立摆的控制采用上述方法进行仿真,实验证明了模型的正确性和有效性,并且具有良好的抗干扰能力,为复杂系统控制寻求了一种新的有效途径。     

The continuity of underperforming ICT projects in the public sector

There is a growing body of research on the successes and failures of information and communications technology (ICT) projects in the public sector. However, this literature has rarely addressed the question of why some projects persist and continue despite functioning poorly in several areas. In this paper, we suggest that the notions of institutional logics and status differences provide useful insights into the structure and trajectory of this type of continuity. We build our arguments through an in-depth qualitative case study of a public information and communications technology (PICT) project in India. From our findings, we develop a process model of PICT project continuity. We explain how the employment of bureaucratic posturing – a manifestation of bureaucratic logic – as a tactic by high status groups could lead to poor performance on several fronts. The paper elaborates on two levels of continuity: policy-level continuity, which in our case was enabled by the logics of decentralization and technocracy, and operational-level continuity, which was achieved when groups with contrasting status-related motivations supported the project.